Rewriting Fuzzy Graphs
نویسندگان
چکیده
This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy graphs are analyzed for pullback rewritings.
منابع مشابه
Fuzzy Graph Rewritings
This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...
متن کاملLearning and Rewriting in Fuzzy Rule Graphs
Di fferent learning algorithms based on learning from examples are described based on a set of graph rewrite rules. Starting from either a very general or a very special rule set which is modeled as graph, two to three basic rewrite rules are applied until a rule graph explaining all examples is reached. The rewrite rules can also be used to model the corresponding hypothesis space as they desc...
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کامل